Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
541	Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Language: English - Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations
542	Separability and Topology Control of Quasi Unit Disk Graphs Jianer Chen∗, Anxiao(Andrew) Jiang∗, Iyad A. Kanj† , Ge Xia‡ , and Fenghui Zhang∗ ∗ Dept. of Computer Science, Texas A&M Univ. College Station, TX Add to Reading List Source URL: www.cs.lafayette.edu Language: English - Date: 2006-11-14 14:35:41 Tree Graph Vertex Planar graph Connectivity Induced path Planar separator theorem Path decomposition Graph theory Graph operations NP-complete problems
543	Sparse Matrix Partitioning for Parallel Eigenanalysis of Large Static and Dynamic Graphs Add to Reading List Source URL: www.ieee-hpec.org Language: English - Date: 2014-08-25 20:44:10 Graph partition Graph Hypergraph Adjacency matrix Topology Line graph Graph theory Mathematics NP-complete problems
544	PDF Document Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-11-04 11:56:54 Graph Tree NP-complete problems Spanning tree Graph partition Planar separator theorem Graph theory Mathematics Theoretical computer science
545	Approaching Optimality For Solving SDD Linear Systems Ioannis Koutis Carnegie Mellon University Email: [removed] Gary L. Miller Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-08-23 12:08:01 NP-complete problems Spanning tree Line graph Time complexity Planar graph Graph partition Minor Trapezoid graph Eulerian path Graph theory Theoretical computer science Mathematics
546	Probabilistic Graph and Hypergraph Matching Ron Zass and Amnon Shashua School of Computer Science and Engineering The Hebrew University of Jerusalem zass,[removed] Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2008-04-08 07:15:41 NP-complete problems Matching Combinatorial optimization Hypergraph 3-dimensional matching Graph Line graph Vertex cover Graph theory Mathematics Theoretical computer science
547	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 12, Add to Reading List Source URL: sensorweb.cs.gsu.edu Language: English - Date: 2013-04-05 09:44:29 NP-complete problems Graph coloring Network topology Networks Wireless networking Unit disk graph Routing Distributed computing Mesh networking Graph theory Theoretical computer science Mathematics
548	Derandomized Graph Products Noga Alon ∗ Uriel Feige† Add to Reading List Source URL: www.tau.ac.il Language: English - Date: 2002-02-21 20:23:30 NP-complete problems Graph coloring Clique Graph operations Independent set Clique problem Line graph Graph theory Theoretical computer science Mathematics
549	PDF Document Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-12-06 15:39:06 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Network flow NP-complete problems Graph theory Immerman–Szelepcsényi theorem Push-relabel maximum flow algorithm Theoretical computer science Computational complexity theory Mathematics
550	A Graphical Model for Simultaneous Partitioning and Labeling Philip J. Cowans Cavendish Laboratory, University of Cambridge, Cambridge, CB3 0HE, United Kingdom [removed] Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2004-11-25 09:53:24 Graph operations NP-complete problems Clique Graph Tree decomposition Markov random field Degeneracy Path decomposition Modular decomposition Graph theory Mathematics Theoretical computer science

UPDATE